Markov Chain Monte Carlo Data Association for Multiple-Target Tracking

نویسندگان

  • Songhwai Oh
  • Stuart Russell
  • Shankar Sastry
چکیده

This paper presents Markov chain Monte Carlo data association (MCMCDA) for solving data association problems arising in multiple-target tracking in a cluttered environment. When the number of targets is fixed, the single-scan version of MCMCDA approximates joint probabilistic data association (JPDA). Although the exact computation of association probabilities in JPDA is NP-hard, we prove that the single-scan MCMCDA algorithm provides a fully polynomial randomized approximation scheme for JPDA. For general multiple-target tracking problems, in which unknown numbers of targets appear and disappear at random times, we present a multi-scan MCMCDA algorithm that approximates the optimal Bayesian filter. It exhibits remarkable performance compared to multiple hypothesis tracking (MHT) under extreme conditions, such as a large number of targets in a dense environment, low detection probabilities, and high false alarm rates.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple Target Tracking Using Spatio-Temporal Monte Carlo Markov Chain Data Association

We propose a framework for general multiple target tracking, where the input is a set of candidate regions in each frame, as obtained from a state of the art background learning, and the goal is to recover trajectories of targets over time from noisy observations. Due to occlusions by targets and static objects, noisy segmentation and false alarms, one foreground region may not correspond to on...

متن کامل

Combining particle MCMC with Rao-Blackwellized Monte Carlo data association for parameter estimation in multiple target tracking

We consider state and parameter estimation in multiple target tracking problems with data association uncertainties and unknown number of targets. We show how the problem can be recast into a conditionally linear Gaussian state-space model with unknown parameters and present an algorithm for computationally efficient inference on the resulting model. The proposed algorithm is based on combining...

متن کامل

A Fully Automated Distributed Multiple-Target Tracking and Identity Management Algorithm

In this paper, we consider the problem of tracking multiple targets and managing their identities in sensor networks. Each sensor is assumed to be able to track multiple targets, manage the identities of targets within its surveillance region, and communicate with its neighboring sensors. The problem is complicated by the fact that the number of targets within the surveillance region of a senso...

متن کامل

On the Performance of Multi-Target Passive Sonar Tracking in Clutter

The problem of tracking multiple targets with passive bearings-only measurements is extremely challenging and rarely addressed explicitly in the literature. The difficulty arises mainly due to the low information content and non-linearity of the received measurements. Furthermore, effects such as high clutter density, closely spaced targets, and crossing targets are commonplace in passive track...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005